Structure of group invariant weighing matrices of small weight
نویسندگان
چکیده
We show that every weighing matrix of weight n invariant under a finite abelian group G can be generated from a subgroup H of G with |H| ≤ 2n−1. Furthermore, if n is an odd prime power and a proper circulant weighing matrix of weight n and order v exists, then v ≤ 2n−1. We also obtain a lower bound on the weight of group invariant matrices depending on the invariant factors of the underlying
منابع مشابه
Investigation of Perfect Ternary Arrays PTA ( 60 , 25 )
Perfect ternary arrays are closely related to difference sets and group invariant weighing matrices. A previous paper by one of the authors demonstrated strong restrictions on difference sets with parameters (120, 35, 10). A perfect ternary array with energy 25 and order 60 – PTA(60,25) – would obey an equation analogous to the difference set equation for (120, 35, 10). A perfect ternary array ...
متن کاملA Search For Solvable Weighing Matrices: supporting documents
This file contains additional information relating to the article: “A Search for Solvable Weighing Matrices,” submitted to Journal of Combinatorial Mathematics and Combinatorial Computing Feb. 25, 2005. In that article, we describe a computer search for group-developed weighing matrices of order 60 and weight 25, which we abbreviate as W (60, 25). Generally speaking, we view weighing matrices a...
متن کاملSOLUTION-SET INVARIANT MATRICES AND VECTORS IN FUZZY RELATION INEQUALITIES BASED ON MAX-AGGREGATION FUNCTION COMPOSITION
Fuzzy relation inequalities based on max-F composition are discussed, where F is a binary aggregation on [0,1]. For a fixed fuzzy relation inequalities system $ A circ^{F}textbf{x}leqtextbf{b}$, we characterize all matrices $ A^{'} $ For which the solution set of the system $ A^{' } circ^{F}textbf{x}leqtextbf{b}$ is the same as the original solution set. Similarly, for a fixed matrix $ A $, the...
متن کاملFiniteness of circulant weighing matrices of fixed weight
Let n be any fixed positive integer. Every circulant weighing matrix of weight n arises from what we call an irreducible orthogonal family of weight n. We show that the number of irreducible orthogonal families of weight n is finite and thus obtain a finite algorithm for classifying all circulant weighing matrices of weight n. We also show that, for every odd prime power q, there are at most fi...
متن کاملGroup developed weighing matrices
A weighing matrix is a square matrix whose entries are 1, 0 or −1, such that the matrix times its transpose is some integer multiple of the identity matrix. We examine the case where these matrices are said to be developed by an abelian group. Through a combination of extending previous results and by giving explicit constructions we will answer the question of existence for 318 such matrices o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 154 شماره
صفحات -
تاریخ انتشار 2018